On universally catenarian pairs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Piecewise catenarian and going between rings

The main purpose of this paper is to prove the following theorem. Let R be a noetherian ring and n a nonnegative integer. Then R[X1, ••• ,Xn] is a going-between ring (=GB) iff R is GB and is (n+l)-piecewise catenarian. PACIFIC JOURNAL OF MATHEMATICS Vol. 86, No. 2, 1980 PIECEWISE CATENARIAN AND GOING BETWEEN RINGS

متن کامل

ON RELATIVE CENTRAL EXTENSIONS AND COVERING PAIRS

Let (G;N) be a pair of groups. In this article, first we con-struct a relative central extension for the pair (G;N) such that specialtypes of covering pair of (G;N) are homomorphic image of it. Second, weshow that every perfect pair admits at least one covering pair. Finally,among extending some properties of perfect groups to perfect pairs, wecharacterize covering pairs of a perfect pair (G;N)...

متن کامل

A UNIVERSALLY OBSERVABLE FLOW ON THE TORUSDe

In this paper, we give the motivation and a brief outline of the construction of an elementary universally observable ow on the two-dimensional torus, i.e. dynamics which are observable by every continuous nonconstant real valued function on the state space. The ow in the construction is C 0 but not C 1. The ideas involved come from topological dynamics and small divisor problems.

متن کامل

On Solving Universally Quantified Horn Clauses

Program proving can be viewed as solving for unknown relations (such as loop invariants, procedure summaries and so on) that occur in the logical verification conditions of a program, such that the verification conditions are valid. Generic logical tools exist that can solve such problems modulo certain background theories, and therefore can be used for program analysis. Here, we extend these t...

متن کامل

Membranes and Nanotubes : Progress on Universally Programmable

We demonstrate how combinatory molecular computation allows parallel selfassembly of several kinds of nanomembranes and nanotubes. One such nanomembrane is a square grid constructed of cross-linked horizontal and vertical chains. We show that a relatively minor change causes it to self-assemble into a nanotube with the same cross-linked structure. A second nanomembrane is a monolayer arranged i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 2008

ISSN: 0022-4049

DOI: 10.1016/j.jpaa.2008.03.001